Hierarchical Cholesky decomposition of sparse matrices arising from curl–curl-equation
نویسندگان
چکیده
منابع مشابه
Hierarchical Cholesky decomposition of sparse matrices arising from curl-curl-equation
A new hierarchical renumbering technique for sparse matrices arising from the application of the Finite Element Method (FEM) to three-dimensional Maxwell’s equations is presented. It allows the complete Cholesky decomposition of the matrix, which leads to a direct solver of O(N 4/3) memory requirement. In addition, an approximate factorisation yielding a preconditioner for the matrix can be con...
متن کاملMultifrontal solution of sparse unsymmetric matrices arising from semiconductor equations
The multifrontal LU method is implemented to solve drift-diffusion models with large sparse matrices arising in the simulation and optimization of semiconductor devices. The performance of this method is compared with the LU algorithm without multifrontal scheme on different computers in the case of a realistic double heterojunction transistor. Résumé On emploie un méthode LU multifrontale pour...
متن کاملSimultaneous Modelling of the Cholesky Decomposition of Several Covariance Matrices
A method for simultaneous modelling of the Cholesky decomposition of several covariance matrices is presented. We highlight the conceptual and computational advantages of the unconstrained parameterization of the Cholesky decomposition and compare the results with those obtained using the classical spectral (eigenvalue) and variance-correlation decompositions. All these methods amount to decomp...
متن کاملOn Optimal Reorderings of Sparse Matrices for Parallel Cholesky Factorizations
The height of the elimination tree has long acted as the only criterion in deriving a suitable fill-preserving sparse matrix ordering for parallel factorization. Although the deficiency in adopting height as the criterion for all circumstances was well recognized, no research has succeeded in alleviating this constraint. In this paper, we extend the unit-cost fill-preserving ordering into a gen...
متن کاملMonotone convex sequences and Cholesky decomposition of symmetric Toeplitz matrices
This paper studies off-diagonal decay in symmetric Toeplitz matrices. It is shown that if the generating sequence of the matrix is monotone, positive and convex then the monotonicity and positivity are maintained through triangular decomposition. The work is motivated by recent results on explicit bounds for inverses of triangular matrices. © 2005 Elsevier Inc. All rights reserved. AMS classifi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Numerical Mathematics
سال: 2007
ISSN: 1570-2820,1569-3953
DOI: 10.1515/jnma.2007.031